Weighted least squares support vector machines: robustness and sparse approximation

Weighted least squares support vector machines: robustness and sparse approximation

Active Learning for Sparse Least Squares Support Vector Machines

For least squares support vector machine (LSSVM) the lack of sparse, while the standard sparse algorithm exist a problem that it need to mark all of training data. We propose an active learning algorithm based on LSSVM to solve sparse problem. This method first construct a minimum classification LSSVM, and then calculate the uncertainty of the sample, select the closest category to mark the sam...

Fuzzy Least Squares Twin Support Vector Machines

Least Squares Twin Support Vector Machine (LSTSVM) is an extremely efficient and fast version of SVM algorithm for binary classification. LSTSVM combines the idea of Least Squares SVM and Twin SVM in which two nonparallel hyperplanes are found by solving two systems of linear equations. Although, the algorithm is very fast and efficient in many classification tasks, it is unable to cope with tw...

Least Squares Support Vector Machines: an Overview

Support Vector Machines is a powerful methodology for solving problems in nonlinear classification, function estimation and density estimation which has also led recently to many new developments in kernel based learning in general. In these methods one solves convex optimization problems, typically quadratic programs. We focus on Least Squares Support Vector Machines which are reformulations t...

Componentwise Least Squares Support Vector Machines

This chapter describes componentwise Least Squares Support Vector Machines (LS-SVMs) for the estimation of additive models consisting of a sum of nonlinear components. The primal-dual derivations characterizing LS-SVMs for the estimation of the additive model result in a single set of linear equations with size growing in the number of data-points. The derivation is elaborated for the classific...